Comparative performance analysis of uniformly distributed applications
نویسندگان
چکیده
A simple programming model of distributed-memory message-passing computer systems is rst applied to describe the couple architecture/application by two sets of parameters. The node timing formula is then derived on the basis of scalar, vector and communication components. A set of suitability functions, extracted from the performance formulae, are deened. These functions are shown to be particularly useful for comparative performance analysis of both existing distributed-memory systems and new architectures under development.
منابع مشابه
Network Location Problem with Stochastic and Uniformly Distributed Demands
This paper investigates the network location problem for single-server facilities that are subject to congestion. In each network edge, customers are uniformly distributed along the edge and their requests for service are assumed to be generated according to a Poisson process. A number of facilities are to be selected from a number of candidate sites and a single server is located at each facil...
متن کاملStrong convergence results for fixed points of nearly weak uniformly L-Lipschitzian mappings of I-Dominated mappings
In this paper, we prove strong convergence results for a modified Mann iterative process for a new class of I- nearly weak uniformly L-Lipschitzian mappings in a real Banach space. The class of I-nearly weak uniformly L-Lipschitzian mappings is an interesting generalization of the class of nearly weak uniformly L-Lipschitzian mappings which inturn is a generalization of the class of nearly unif...
متن کاملExploring pseudo- and chaotic random Monte Carlo simulations
Computer simulations are an increasingly important area of geoscience research and development. At the core of stochastic or Monte Carlo simulations are the random number sequences that are assumed to be distributed with specific characteristics. Computer-generated random numbers, uniformly distributed on (0, 1), can be very different depending on the selection of pseudo-random number (PRN) or ...
متن کامل-dimensional Parallel Fft Benchmark on Suprenum
A distributed memory vectorised 1-dimensional FFT benchmark is rst presented. The performance results of this benchmark on SUPRENUM are given and discussed. A performance analysis of the distributed memory FFT benchmark is performed and Hockney's performance parameters (r1 and n 1=2) are then employed to derive the performance formula. This formula is shown to t the experimental results very we...
متن کاملComparative benchmarking of cloud computing vendors with High Performance Linpack
We present a comparative analysis of the maximum performance achieved by the Linpack benchmark [1] on compute intensive hardware publicly available from multiple cloud providers. We study both performance within a single compute node, and speedup for distributed memory calculations with up to 32 nodes or at least 512 computing cores. We distinguish between hyper-threaded and non-hyper-threaded ...
متن کامل